Removing inessential points in c-and A-optimal design

نویسندگان

چکیده

A design point is inessential when it does not contribute to an optimal design, and can therefore be safely discarded from the space. We derive three inequalities for detection of such points in c-optimal design: first two are direct consequences equivalence theorem c-optimality; third one derived a second-order cone programming formulation design. Elimination rules A-optimal obtained as byproduct. When implemented within optimization algorithm, each inequality gives screening test that may provide substantial acceleration by reducing size problem online. Several examples presented with multiplicative algorithm illustrate effectiveness approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

D-optimum Design Algorithms by Removing Non-optimal Support Points

Numerical algorithms for D-optimum design usually rely on a discretization of the design space into a finite set X. Their speed then depends on the cardinality of this set. We show in this paper how it is possible, during the search for an optimum design, to remove from X some design points that cannot be support points of the optimum design, and therefore to accelerate the algorithms.

متن کامل

Improvements on removing non-optimal support points in D-optimum design algorithms

We improve the inequality used in (Pronzato, 2003) to remove points from the design space during the search for a D-optimum design. Let ξ be any design on a compact space X ⊂ Rm with a nonsingular information matrix, and let m + ǫ be the maximum of the variance function d(ξ,x) over all x ∈ X . We prove that any support point x∗ of a D-optimum design on X must satisfy the inequality d(ξ,x∗) ≥ m(...

متن کامل

Inessential Features

If one converts surface lters into context free rules, one has to introduce new features. These features are strictly nonlexical, and their distribution is predictable from the distribution of the lexical features. Now, given a (feature based) context free grammar, we ask whether one can identify the nonlexical features. This is not possible; however, the notion of an inessential feature ooers ...

متن کامل

C*-Extreme Points and C*-Faces oF the Epigraph iF C*-Affine Maps in *-Rings

Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...

متن کامل

On the Optimal Frequency and Timing of Control Points in a Project’s Life Cycle

The dynamic nature of projects and the fact that they are carried out in changing environments, justify the need for their periodic monitoring and control. Collection of information about the performance of projects at control points costs money. The corrective actions that may need to be taken to bring the project in line with the plan also costs money. On the other hand, penalties are usually...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Planning and Inference

سال: 2021

ISSN: ['1873-1171', '0378-3758']

DOI: https://doi.org/10.1016/j.jspi.2020.11.011